Gaps and Triangles
نویسندگان
چکیده
In this paper, we derive principles of optimal cyclical monetary policy in an economy without capital, with a cash-in-advance restriction on household transactions, and monopolistic firms that set prices one period in advance. The only distortionary policy instruments are the nominal interest rate and the money supply. In this environment it is feasible to undo both the cash-in-advance and price setting restrictions, but not the distortion due to monopolistic competition. We show that it is optimal to follow the Friedman rule, and thus offset the cash-in-advance restriction. We also find that, in general, it is not optimal to undo the price setting restriction, so that a simple criterion of eliminating gaps is not optimal. Sticky prices provide the planner with tools to improve upon a distorted flexible price allocation.
منابع مشابه
Similar Triangles, Another Trace of the Golden Ratio
In this paper we investigate similar triangles which are not congruent but have two pair congruent sides. We show that greatest lower bound of values for similarity ratio of such triangles is golden ratio. For right triangles, we prove that the supremum of values for similarity ratio is the square root of the golden ratio.
متن کاملOn Tensor Product of Graphs, Girth and Triangles
The purpose of this paper is to obtain a necessary and sufficient condition for the tensor product of two or more graphs to be connected, bipartite or eulerian. Also, we present a characterization of the duplicate graph $G 1 K_2$ to be unicyclic. Finally, the girth and the formula for computing the number of triangles in the tensor product of graphs are worked out.
متن کاملEfficiency and stabilization : reducing Harberger triangles and Okun gaps
We provide in this paper a simple example of a dynamic stochastic imperfectly competitive economy in which introducing some distortive taxation increases both allocation efficiency and stabilization. 2001 Published by Elsevier Science B.V.
متن کاملIncremental Mesh-based Integration of Registered Range Images: Robust to Registration Error and Scanning Noise
Existing integration algorithms often assume that the registration error of neighbouring views is an order of magnitude less than the measurement error [3]. This assumption is very restrictive that automatic registration algorithms can hardly meet. In this paper, we develop a novel integration algorithm, robust to both large registration errors and heavy scanning noise. Firstly, a pre-processin...
متن کاملSome finite groups with divisibility graph containing no triangles
Let $G$ be a finite group. The graph $D(G)$ is a divisibility graph of $G$. Its vertex set is the non-central conjugacy class sizes of $G$ and there is an edge between vertices $a$ and $b$ if and only if $a|b$ or $b|a$. In this paper, we investigate the structure of the divisibility graph $D(G)$ for a non-solvable group with $sigma^{ast}(G)=2$, a finite simple group $G$ that satisfies the one-p...
متن کامل